Cross-Model Conjunctive Queries over Relation and Tree-Structured Data

Conjunctive queries are the most basic and central class of database queries. With continued growth demands to manage process massive volume different types data, there is little research study conjunctive between relation tree data. In this paper, we Cross-Model Queries (CMCQs) over tree-structured data (XML JSON). To efficiently CMCQs with bounded intermediate results first encode nodes position information. node original label values encoded values, it allows our proposed algorithm CMJoin join relations simultaneously, avoiding results. achieves worst-case optimality in terms total result values. Experimental demonstrate efficiency scalability techniques answer a CMCQ running time size.KeywordsCross-model joinWorst-case optimalRelation